Distributed Dynamic Lightpath Allocation in Survivable WDM Networks

This project is to investigate a distributed algorithm for solving the dynamic routing and wavelength assignment (RWA) problem using both dedicated and shared path protection techniques for survivable wavelength division multiplexing (WDM) networks. Our goal of this project is to minimize the number of wavelength-links for each new connection, and satisfy communication requests as much as possible based on the given limited network resources. Each network node operates independently using the local information of the network, and communicates to each other by passing control messages. We tested our distributed algorithm by a set of well-known networks. Compared to optimal solutions using ILP formulations, heuristics solutions based on the distributed algorithm are more scalable and faster.